Exchangeable Processes which are Functions of Stationary Markov Chains
نویسندگان
چکیده
منابع مشابه
Stationary Probabilities of Markov Chains
In this paper, based on probabilistic arguments, we obtain an explicit solution of the stationary distribution for a discrete time Markov chain with an upper Hessenberg time stationary transition probability matrix. Our solution then leads to a numerically stable and eecient algorithm for computing stationary probabilities. Two other expressions for the stationary distribution are also derived,...
متن کاملMarkov Chains , Coupling , Stationary Distribution
In this lecture, we will introduce Markov chains and show a potential algorithmic use of Markov chains for sampling from complex distributions. For a finite state space Ω, we say a sequence of random variables (Xt) on Ω is a Markov chain if the sequence is Markovian in the following sense, for all t, all x0, . . . , xt, y ∈ Ω, we require Pr(Xt+1 = y|X0 = x0, X1 = x1, . . . , Xt = xt) = Pr(Xt+1 ...
متن کاملStationary Markov Processes
We consider some classes of stationary, counting{measure{valued Markov processes and their companions under time{reversal. Examples arise in the L evy{It^ o decomposition of stable Ornstein{Uhlenbeck processes, the large{time asymptotics of the standard additive coalescent, and extreme value theory. These processes share the common feature that points in the support of the evolving counting{ me...
متن کاملExchangeable Markov Processes on Graphs: Feller Case
The transition law of every exchangeable Feller process on the space of countable graphs is determined by a σ-finite measure on the space of {0, 1} × {0, 1}-valued arrays. In discrete-time, this characterization amounts to a construction from an independent, identically distributed sequence of exchangeable random functions. In continuous-time, the behavior is enriched by a Lévy–Itô-type decompo...
متن کاملStopped Markov chains with stationary occupation times
Let E be a nite set equipped with a group G of bijective transformations and suppose that X is an irreducible Markov chain on E that is equivariant under the action of G. In particular, if E = G with the corresponding transformations being left or right multiplication, then X is a random walk on G. We show that when X is started at a xed point there is a stopping time U such that the distributi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1964
ISSN: 0003-4851
DOI: 10.1214/aoms/1177703768